Doubly near resolvable m-cycle systems
نویسنده
چکیده
An m-cycle system C of λKn is said to be near resolvable if the mcycles in C can be partitioned into near parallel classes R1, R2, . . . , Rλn/2, each one of which is a 2-factor of λKn − v for some vertex v in λKn. If an NR(n,m, λ)-CS has a pair of orthogonal resolutions, it is said to be doubly resolvable and is denoted by DNR(n,m, λ)-CS. For m = 2, 3, DNR(n,m, 2)-CSs are known as Room frames of type 1 and DNR(n, 3, 2)-BIBDs, respectively. The spectra for Room frames of type 1 and DNR(n, 3, 2)-BIBDs have been completed. To our knowledge, very little is known about the existence of DNR(n,m, λ)-CSs with m ≥ 4. In this paper, we use Weil’s theorem on character sum estimates to give an implicit lower bound about the existence of DNR(mt + 1,m, λ)-CSs, where mt+1 is a prime power. From this result, we also show that there exists a DNR(n, 4, λ)-CS for any prime power n ≡ 1 (mod 4) and n ≥ 13.
منابع مشابه
Existence of doubly near resolvable (v, 4, 3) BIBDs
The existence of doubly near resolvable (v, 2, 1)-BIBDs was established by Mullin and Wallis in 1975. For doubly near resolvable (v, 3, 2)-BIBDs, the existence problem was investigated by Lamken in 1994, and completed by Abel, Lamken and Wang in 2007. In this paper, we look at doubly near resolvable (v, 4, 3)-BIBDs; we establish that these exist whenever v ≡ 1 (mod 4) except for v = 9 and possi...
متن کاملA Method for Classification of Doubly Resolvable Designs and Its Application
The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property—they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications. Therefore the classification of doubly resol...
متن کاملDoubly resolvable designs with small parameters
Doubly resolvable 2-(v,k,λ) designs (DRDs) with small parameters and their resolutions which have orthogonal resolutions (RORs) are constructed and classified up to isomorphism. Exact values or lower bounds on the number of the nonisomorphic sets of m mutually orthogonal resolutions (m-MORs) are presented. The implemented algorithms and the parameter range of this method are discussed, and the ...
متن کاملThe Existence of DNR ( mt + 1 , m , m − 1 ) - BIBDs
A (v, m, m − 1)-BIBD D is said to be near resolvable (NRBIBD) if the blocks of D can be partitioned into classes R1, R2, . . . , Rv such that for each point x of D, there is precisely one class having no block containing x and each class contains precisely v − 1 points of the design. If an (v, m, λ)-NRBIBD has a pair of orthogonal resolutions, it is said to be doubly resolvable and is denoted D...
متن کاملOn α-resolvable directed cycle systems for cycle length 4
A directedm-cycle system of order v with index λ, denotedm-DCS(v, λ), is a collection of directed cycles of length m whose directed edges partition the directed edges of λDKv. An m-DCS(v, λ) is α-resolvable if its directed cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 42 شماره
صفحات -
تاریخ انتشار 2008